Slicing Object-Z Specifications for Verification
نویسندگان
چکیده
Slicing is the activity of reducing a program or a specification with respect to a given condition (the slicing criterion) such that the condition holds on the full program if and only if it holds on the reduced program. Originating from program analysis the entity to be sliced is usually a program and the slicing criterion a value of a variable at a certain program point. In this paper we present an approach to slicing Object-Z specifications with temporal logic formulae as slicing criteria and show the correctness of our approach. The underlying motivation is the goal to substantially reduce the size of the specification and subsequently facilitate verification of temporal logic properties.
منابع مشابه
Deductive Verification for Improving Slicing of Integrated Formal Specifications
The combination of the two well known formal specification techniques CSP [Hoa85] for behavioural aspects of systems and Object-Z (OZ) [Smi00] for data aspects of systems into the specification language CSPOZ [Fis97] has already been subject of intense research. An important challenge, especially when trying to automatically or semi-automatically analyse such specifications, is their inherent c...
متن کاملSlicing CSP-OZ Specifications for Verification
The combination of the two well known formal specification techniques CSP [Hoa78] for specification of behavioural aspects of systems and Object-Z (OZ) for specification of data aspects of systems into the specification language CSP-OZ [Fis97] has already been subject of intense research. An important challenge is their inherent complexity which quickly goes beyond the scope of current analysis...
متن کاملOptimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties as described by the slicing criterion are preserved, i.e., they hold in the complete program if and only if they hold in the sliced program. In verification, slicing is often employed to reduce the state space of spec...
متن کاملSlicing techniques for verification re-use
In this paper we discuss which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specifically, we will investigate when a temporal logic property of an Object-Z class is preserved under a modification or extension of the class with new features. To this end, we use the slicing technique from program analysis which provi...
متن کاملTowards Certified Slicing
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correctness of slicing, which should ideally be proven independent of concrete programming languages and with the help of well-known verifying techniques such as proof assistants. As a first step in this direction, this cont...
متن کامل